Single pass streaming BLAST on FPGAs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single pass streaming BLAST on FPGAs

Approximate string matching is fundamental to bioinformatics and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA implementations of both BLAST- and dynamic-programming- (DP) based methods. Our primary contribution is a new algorithm for emulating the seeding and extension phases of BLAST. This operates in a single pass through a database at str...

متن کامل

Streaming Systems in FPGAs

As FPGA devices have become larger and more capable, they have transitioned from being used primarily as flexible glue logic to being used as central data processing elements in many digital systems. Typically, these systems (including video processing, wired and wireless networking) rely on streaming architectures. These architectures differ significantly from traditional processor architectur...

متن کامل

Single Pass SVM using Minimum Enclosing Ball of Streaming Data

We present a stream algorithm for large scale classification (in the context of l2-SVM) by leveraging connections between learning and computational geometry. The stream model [1] imposes the constraint that only a single pass over the data is allowed. We study the streaming model for the problem of binary classification with SVMs and propose a single pass SVM algorithm based on the minimum enc...

متن کامل

Single pass sparsification in the streaming model with edge deletions

In this paper we give a construction of cut sparsifiers of Benczúr and Karger in the dynamic streaming setting in a single pass over the data stream. Previous constructions either required multiple passes or were unable to handle edge deletions. We use Õ(1/ǫ) time for each stream update and Õ(n/ǫ) time to construct a sparsifier. Our ǫ-sparsifiers have O(n log n/ǫ) edges. The main tools behind o...

متن کامل

Randomized Multi-pass Streaming Skyline Algorithms

We consider external algorithms for skyline computation without pre-processing. Our goal is to develop an algorithm with a good worst case guarantee while performing well on average. Due to the nature of disks, it is desirable that such algorithms access the input as a stream (even if in multiple passes). Using the tools of randomness, proved to be useful in many applications, we present an eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Parallel Computing

سال: 2007

ISSN: 0167-8191

DOI: 10.1016/j.parco.2007.09.003